A cache friendly red black tree implementation that allocates a single vector of nodes.
Example:
use RedBlackTree;
let mut tree = with_capacity;
tree.set?;
tree.set?;
tree.set?;
tree.set?;
for in tree
Outputs:
50: Trees
75: are
100: very
150: cool!